Short paths in ε-regular pairs and small diameter decompositions of dense graphs
نویسندگان
چکیده
In this paper we give optimal optimal vertex degree conditions that guarantee connection by short paths in ε-regular bipartite graphs. We also study a related question of decomposing an arbitrary graph into subgraphs of small diameter.
منابع مشابه
Conditional Hardness for Sensitivity Problems
In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allows to apply batch updates of small size to the original input data. The sensitivity model is particularly appealing since recent strong conditional lower bounds ruled out fast algorithms for many dynamic problems, such...
متن کاملThe Robust Component Structure of Dense Regular Graphs and Applications
In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a graph is robustly expanding if it still expands after the deletion of a small fraction of its vertices and edges. Our main result allows us to harness the us...
متن کاملThe Displacement and Split Decompositions for a Q-Polynomial Distance-regular Graph
Let Γ denote a Q-polynomial distance-regular graph with diameter at least three and standard module V . We introduce two direct sum decompositions of V . We call these the displacement decomposition for Γ and the split decomposition for Γ. We describe how these decompositions are related.
متن کاملFinding paths in sparse random graphs requires many queries
We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph G ∼ G(n, p) in order to find a subgraph which possesses some target property with high probability. In this paper we focus on finding long paths in G ∼ G(n, p) when p = 1+ε n for some fixed constant ε > 0. This random gra...
متن کاملPath decompositions and perfect path double covers
We consider edge-decompositions of regular graphs into isomorphic paths. An m-PPD (perfect path decomposition) is a decomposition of a graph into paths of length m such that every vertex is an end of exactly two paths. An m-PPDC (perfect path double cover) is a covering of the edges by paths of length m such that every edge is covered exactly two times and every vertex is an end of exactly two ...
متن کامل